Characterizing extreme points as basic feasible solutions in infinite linear programs
نویسندگان
چکیده
منابع مشابه
Characterizing extreme points as basic feasible solutions in infinite linear programs
We consider linear programs with countably many equality constraints and variables, i.e., Countably Infinite Linear Programs (CILPs). CILPs subsume infinite network flow problems [4] and non-stationary infinite horizon deterministic and stochastic dynamic programs [3]. Recall that a vector x in a convex subset S of a vector space is called an extreme point of S if it cannot be expressed as a st...
متن کاملVariational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
This paper concerns applications of advanced techniques of variational analysis and generalized differentiation to parametric problems of semi-infinite and infinite programming, where decision variables run over finite-dimensional and infinite-dimensional spaces, respectively. Part I is primarily devoted to the study of robust Lipschitzian stability of feasible solutions maps for such problems ...
متن کاملRobust optimization in countably infinite linear programs
A robust optimization framework for countably infinite linear programs (CILPs) is developed. It is shown that a particular robust counterpart of a nominal CILP can be reformulated as another CILP. A bound on the probability of constraint violation is derived. A convergent algorithm for solving this robust CILP is proposed.
متن کاملInverse optimization in countably infinite linear programs
Given the costs and a feasible solution for a linear program, inverse optimization involves finding new costs that are close to the original ones and make the given solution optimal. We develop an inverse optimization framework for countably infinite linear programs using the weighted absolute sum metric. We reformulate this as an infinite-dimensional mathematical program using duality. We prop...
متن کاملApproximating Extreme Points of Infinite Dimensional Convex Sets
The property that an optimal solution to the problem of minimizing a continuous concave function over a compact convex set in IRn is attained at an extreme point is generalized by the Bauer Minimum Principle to the infinite dimensional context. The problem of approximating and characterizing infinite dimensional extreme points thus becomes an important problem. Consider now an infinite dimensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2009
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.09.002